Spanning tree with lower bound on the degrees
نویسندگان
چکیده
منابع مشابه
Linear Lower Bound on Degrees
It is established a linear (thereby, sharp) lower bound on degrees of Positivstellensatz calculus refutations over a real eld introduced in GV99], for the Tseitin tautologies and for the parity (the mod 2 principle). We use the machinery of the Laurent proofs developped for binomial systems in BuGI 98], BuGI 99].
متن کاملOn the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope
In the study of extensions of polytopes of combinatorial optimization problems, a notorious open question is that for the size of the smallest extended formulation of the Minimum Spanning Tree problem on a complete graph with n nodes. The best known lower bound is the trival (dimension) bound, Ω(n), the best known upper bound is the extended formulation by Wong (1980) of size O(n) (also Martin,...
متن کاملA Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of Ω(D+ √ n/ logn) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter D = Ω(logn), in the bounded message model. This establishes the asymptotic nearoptimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D + √ n log∗ n).
متن کاملTransforming spanning trees: A lower bound
For a planar point set we consider the graph of crossing-free straight-line spanning trees where two spanning trees are adjacent in the graph if their union is crossing-free. An upper bound on the diameter of this graph implies an upper bound on the diameter of the flip graph of pseudo-triangulations of the underlying point set. We prove a lower bound of Ω ( log(n)/ log(log(n)) ) for the diamet...
متن کاملAn Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree Verification Problem
We consider the problem of preprocessing an edgeweighted tree in order to quickly answer queries of the following type: does a given edge belong in the minimum spanning tree of ? Whereas the offline minimum spanning tree verification problem admits a lovely linear time solution, we demonstrate an inherent inverseAckermann type tradeoff in the online MST verification problem. In particular, any ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.12.005